1-String B_2-VPG Representation of Planar Graphs
نویسندگان
چکیده
In this paper, we prove that every planar graph has a 1-string B2-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
منابع مشابه
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs
In this paper, we show that any B2-VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into O(logn) outerstring graphs or O(log n) permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on B2-VPG graphs.
متن کاملString graphs of k-bend paths on a grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. If the number k of bends is not restricted, then the VPG graphs are shown to be equivalent to the well-known class of string graphs, namely, the in...
متن کامل1-string B1-VPG-representations of planar partial 3-trees and some subclasses
Planar partial 3-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree 3 into a face. In this paper, we show that planar partial 3-trees have 1-string B1-VPG representations, i.e., representations where every vertex is represented by an orthogonal curve with at most one bend, every two curves intersect at most once, and intersections of curves correspond...
متن کاملPlanar Graphs as VPG-Graphs
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG. We also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a...
متن کاملVertex Intersection Graphs of Paths on a Grid
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, k ≥ 0. In chip manufacturing, circuit layout is modeled as paths (wires) on a grid, where it is natural to constrain the number of bends per wire for reas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 7 شماره
صفحات -
تاریخ انتشار 2015